Simple Bounds for Queues Fed by Markovian Sources: A Tool for Performance Evaluation
نویسندگان
چکیده
ATM traac is complex but only simple statistical models are amenable to mathematical analysis. We discuss a class of queuing models which is wide enough to provide models which can reeect the features of real traac, but which is simple enough to be analytically tractable, and review the bounds on the queue-length distribution that have been obtained. We use them to obtain bounds on QoS parameters and to give approximations to the eeective bandwidth of such sources. We present some numerical techniques for calculating the bounds eeciently and describe an implementation of them in a computer package which can serve as a tool for qualitative investigations of performance in queuing systems.
منابع مشابه
Large Deviations Bounds for a Polling System with Markovian On/off Sources and Bernoulli Service Schedule
In this paper we consider a large deviations problem for a discrete-time polling system consisting of two-parallel queues and a single server. The arrival process of each queue is a superposition of traffic streams generated by a number of mutually independent and identical Markovian on/off sources, and the single server serves the two queues according to the so-called Bernoulli service schedul...
متن کاملUpper Bounds on Performance Measures of Heterogeneous M/M/c Queues
In many real-life queueing systems, the servers are often heterogeneous, namely they work at different rates. This paper provides a simple method to compute tight upper bounds on two important performance measures of single-class heterogeneous multi-server Markovian queueing systems, namely the average number in queue and the average waiting time in queue. This method is based on an expansion o...
متن کاملA Unified Method of Analysis for Queues with Markovian Arrivals
We deal with finite-buffer queueing systems fed by a Markovian point process. This class includes the queues of type M/G/1/N, M/G/1/N, PH/G/1/N, MMPP/G/1/N, MAP/G/1/N, and BMAP/G/1/N and is commonly used in the performance evaluation of network traffic buffering processes. Typically, such queueing systems are studied in the stationary regime using matrixanalytic methods connected with M/G/1-typ...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملOn the Convergence of MMPP and Fractional ARIMA Processes with Long-Range Dependence to Fractional Brownian Motion
Though the various models proposed in the literature for capturing the long-range dependent nature of network traac are all either exactly or asymptotically second order self-similar, their eeect on network performance can be very diierent. We are thus motivated to characterize the limiting distributions of these models so that they lead to parsimonious modeling and a better understanding of ne...
متن کامل